Generic Schema Matching, Ten Years Later

نویسندگان

  • Philip A. Bernstein
  • Jayant Madhavan
  • Erhard Rahm
چکیده

In a paper published in the 2001 VLDB Conference, we proposed treating generic schema matching as an independent problem. We developed a taxonomy of existing techniques, a new schema matching algorithm, and an approach to comparative evaluation. Since then, the field has grown into a major research topic. We briefly summarize the new techniques that have been developed and applications of the techniques in the commercial world. We conclude by discussing future trends and recommendations for further work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Schema Matching Bibtex

The proposed matching system aims to discover in an automatic way, the correspondence links A survey of approaches to automatic schema matching. Comparing SSD-placement strategies to scale a database-in-the-cloud. Generic Schema Matching, Ten Years Later. Corpus-based Schema Matching. Importing Items via basic bibliographic formats (Endnote, BibTex, RIS, TSV, as for outputing them in appropriat...

متن کامل

Generic Schema Matching With Cupid Jayant Madhavan

ACM Trans. Database Syst. 30(2), 2005, 624-660. PDF, Jayant Madhavan, Philip A. Bernstein, Erhard Rahm Generic Schema Matching with Cupid VLDB'01 fragment research considering keith fixed jayant survey EVALUATION application 425 van 77–94 key matching printed christian errorm molina likelihood dynamic following arrow parent data madhavan heuristic strategie staab quantitative yanni recall 1000 ...

متن کامل

Comparing Similarity Combination Methods For Schema Matching

similarities are normally measured separately with different methods and then a competitive matching performance compared to gating them later with a combination method, 2) Pirró and Talia (2010) is a generic schema matching. mainly focused on developing matching techniques to find equivalent elements among the different XML sources. compared to produce a node similarity coefficient that reflec...

متن کامل

A Generic Algorithm for Heterogeneous Schema Matching

Schema matching is a basic problem nowadays in many application areas, such as data integration, data warehouse and e-business. In this paper, we propose a generic schema matching method called GSM (Generic Schema Matching) and its optimizing approaches. GSM provides an extensible library of match algorithms to support multi-strategy matching approach. It also uses a mapping knowledge base to l...

متن کامل

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • PVLDB

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2011